A Picturesque Maze Generation Algorithm with Any Given Endpoints

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How to make a picturesque maze

In the picturesque maze generation problem, we are given a rectangular black-and-white raster image and want to randomly generate a maze in which the solution path fills up the black pixels. While a simple formulation of the problem faces with NP-hardness, the proposed method generates such a maze in polynomial time by appropriately changing the formulation itself. Therefore, the algorithm itse...

متن کامل

Folding Any Orthogonal Maze

We develop an algorithm to fold a square of paper into an orthogonal maze of ridges protruding out of a square base. More precisely, given an orthogonal graph drawn on a square, we fold a constant-factor larger square of paper into the square with the orthogonal graph extruded orthogonally to a specified (uniform) height. The zero-thickness ridges could form a path like the Hilbert curve, a maz...

متن کامل

Spherical Maze Generation

In this paper, we proposed an automatic spherical maze generation framework. Traditional mazes are generated on two or three dimensional spaces, with regular grids as walls and paths. Instead of pure two or three dimensional mazes, we automatically generate maze on the surface of a sphere, which provides a unique and fresh maze solving experience. Because regular grids on spherical surface will...

متن کامل

Digraphs that have at most one walk of a given length with the same endpoints

Let Θ(n, k) be the set of digraphs of order n that have at most one walk of length k with the same endpoints. Let θ(n, k) be the maximum number of arcs of a digraph in Θ(n, k). We prove that if n ≥ 5 and k ≥ n − 1 then θ(n, k) = n(n−1)/2 and this maximum number is attained at D if and only if D is a transitive tournament. θ(n, n− 2) and θ(n, n− 3) are also determined.

متن کامل

Polynomial-time Approximation Algorithm for finding Highly Comfortable Team in any given Social Network

There are many indexes (measures or metrics) in Social Network Analysis (SNA), like density, cohesion, etc. In this paper, we define a new SNA index called “comfortability ”. One among the lack of many factors, which affect the effectiveness of a group, is “comfortability ”. So, comfortability is one of the important attributes (characteristics) for a successful team work. It is important to fi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Information Processing

سال: 2013

ISSN: 1882-6652

DOI: 10.2197/ipsjjip.21.393